A Fast 4 $\times$ 4 Forward Discrete Tchebichef Transform Algorithm
نویسندگان
چکیده
منابع مشابه
Image Compression Using Discrete Tchebichef Transform Algorithm
─ The Discrete Tchebichef Transform (DTT) based on orthogonal Tchebichef polynomials can be an alternative to Discrete Cosine Transform (DCT) for JPEG image compression standard. The properties of DTT are not only very similar to DCT; it has also higher energy compactness and lower computational advantage using a set of recurrence relation. Through extensive simulation, image reconstruction acc...
متن کاملCOSC460 Honours Report A Fast Discrete Tchebichef Transform Algorithm for Image Compression
The Discrete Tchebichef Transform (DTT) is a transform method based on the scaled orthogonal Tchebichef polynomials, which have applications recently found in image compression and pattern recognition. This report summarises the research carried out for the development of a fast DTT algorithm. The mathematical properties and the related algorithmic details of the Discrete Cosine Transform (DCT)...
متن کاملImage Compression Using a Fast and Efficient Discrete Tchebichef Transform Algorithm
The Discrete Tchebichef Transform (DTT) which based on discrete orthogonal Tchebichef polynomials can be an alternative to the Discrete Cosine Transform (DCT) for image processing such as image compression and image recognition as the properties of the DTT are similar to that of the DCT. The DTT not only has higher energy compactness than the DCT in images that have high illumination value vari...
متن کاملSmooth Formant Peak Via Discrete Tchebichef Transform
Department of System and Computer Communication, Faculty of Information and Communication Technology, Universiti Teknikal Malaysia Melaka, Melaka 76100, Malaysia Department of Information Technology, Faculty of Computer Science, Universitas Dian Nuswantoro, Semarang 50131, Indonesia Department of Electrical Engineering Technology, Faculty of Engineering Technology, Universiti Teknikal Malaysia ...
متن کاملA Fast Two-Dimension 4×4 Inverse Integer Transform Algorithm for Real-time H.264 Decoder
ABSTRACT. This Paper presents a new fast two-dimensional 4×4 (2-D 4×4) inverse integer transform algorithm. The algorithm takes advantage of the symmetries of basic images and makes use of the characteristic of the transform data of practical videos. Compared to other fast algorithms, the number of addition and shift operations for the inverse transform can be reduced greatly. Numerical results...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Signal Processing Letters
سال: 2007
ISSN: 1070-9908
DOI: 10.1109/lsp.2007.898331